Pareto optimality in many-to-many matching problems
نویسندگان
چکیده
منابع مشابه
Pareto optimality in many-to-many matching problems
Consider a many-to-many matching market that involves two finite disjoint sets, a set of applicants A and a set of courses C. Each applicant has preferences on the different sets of courses she can attend, while each course has a quota of applicants that it can admit. In this paper, we examine Pareto optimal matchings (briefly POM) in the context of such markets, that can also incorporate addit...
متن کاملCredible group stability in many-to-many matching problems
It is known that in two-sided many-to-many matching problems, pairwisestable matchings may not be immune to group deviations, unlike in many-to-one matching problems (Blair 1988). In this paper, we show that pairwise stability is equivalent to credible group stability when one side has responsive preferences and the other side has categorywise-responsive preferences. A credibly group-stable mat...
متن کاملMany-to-Many Graph Matching
Postcode 06560 City Sogutozu State Ankara Country Turkey Author Degree Dr.
متن کاملMany-to-Many Matching Design∗
We study second-degree price discrimination in markets where the product traded by the monopolist is access to other agents. We derive necessary and suffi cient conditions for the welfareand the profit-maximizing mechanisms to employ a single network or a menu of non-exclusive networks. We characterize the optimal matching schedules under a wide range of preferences, derive implications for pri...
متن کاملRandom paths to pairwise stability in many-to-many matching problems: a study on market equilibration
This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such that each matching on the path is formed by satisfying a blocking individual or a blocking pair for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2014
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.09.002